Experiments with a network design algorithm using -approximate linear programs
نویسنده
چکیده
We describe an upper-bound algorithm for multicommodity network design problems that relies on new results for approximately solving certain linear programs, and on the greedy heuristic for set-covering problems.
منابع مشابه
ACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem
The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...
متن کاملA Simulated Annealing Algorithm for Unsplittable Capacitated Network Design
The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...
متن کاملExperimental investigation, modeling, and optimization of combined electro-(fenton/coagulation/flotation) process: design of experiments and artificial intelligence systems
In this study, a combined electro-(Fenton/coagulation/flotation) (EF/EC/El) process was studied via degradation of Disperse Orange 25 (DO25) organic dye as a case study. Influences of seven operational parameters on the dye removal efficiency (DR%) were measured: initial pH of the solution (pH0), applied voltage between the anode and cathode (V), initial ferrous ion concentration (CFe), initial...
متن کاملA Dynamic Disaggregation Approach to Approximate Linear Programs for Network Revenue Management*
The linear programming approach to approximate dynamic programming has received considerable attention in the recent network revenue management literature. A major challenge of the approach lies in solving the resulting approximate linear programs (ALPs), which often have a huge number of constraints and/or variables. Starting from a recently developed compact affine ALP for network revenue man...
متن کاملApproximately Solving Large-scale Linear Programs. I. Strengthening Lower Bounds and Accelerating Convergence
This report describes computational experience with an implementation of Plotkin-Shmoys-Tardos and Grigoriadis-Khachiyan approximation algorithm for block-angular linear programs, together with a technique for improving Lagrangian relaxations. Our implementation produces fast approximate solutions to large pure multicommodity ow problems, and linear programs arising in network design. A prelimi...
متن کامل